Analysis of Deeply Virtual Compton Scattering Data at Jefferson Lab and Proton Tomography

The CLAS and Hall A collaborations at Jefferson Laboratory have recently released new results for the ep->ep{\gamma} reaction. We analyze these new data within the Generalized Parton Distribution formalism. Employing a fitter algorithm introduced and used in earlier works, we are able to extract from these data new constraints on the kinematical dependence of three Compton Form Factors. Based on experimental data, we subsequently extract the dependence of the proton charge radius on the quarks longitudinal momentum fraction.Comment: 25 pages, 26 figure

Linux Low-Latency Tracing for Multicore Hard Real-Time Systems

Real-time systems have always been difficult to monitor and debug because of the timing constraints which rule out any tool significantly impacting the system latency and performance. Tracing is often the most reliable tool available for studying real-time systems. The real-time behavior of Linux systems has improved recently and it is possible to have latencies in the low microsecond range. Therefore, tracers must ensure that their overhead is within that range and predictable and scales well to multiple cores. The LTTng 2.0 tools have been optimized for multicore performance, scalability, and flexibility. We used and extended the real-time verification tool rteval to study the impact of LTTng on the maximum latency on hard real-time applications. We introduced a new real-time analysis tool to establish the baseline of real-time system performance and then to measure the impact added by tracing the kernel and userspace (UST) with LTTng. We then identified latency problems and accordingly modified LTTng-UST and the procedure to isolate the shielded real-time cores from the RCU interprocess synchronization routines. This work resulted in extended tools to measure the real-time properties of multicore Linux systems, a characterization of the impact of LTTng kernel and UST tracing tools, and improvements to LTTng

Cohomologie des variétés de Deligne-Lusztig

We study the cohomology of Deligne-Lusztig varieties with aim the construction of actions of Hecke algebras on such cohomologies, as predicted by the conjectures of Broué, Malle and Michel ultimately aimed at providing an explicit version of the abelian defect conjecture. We develop the theory for varieties associated to elements of the braid monoid and partial compactifications of them. We are able to compute the cohomology of varieties associated to (possibly twisted) rank $2$ groups and powers of the longest element $w_0$ (some indeterminacies remain for $G_2$). We use this to construct Hecke algebra actions on the cohomology of varieties associated to $w_0$ or its square, for groups of arbitrary rank. In a subsequent work, we construct actions associated to more general regular elements and we study their trace on cohomology

Improving Resource Discovery in the Arigatoni Overlay Network

International audienceArigatoni is a structured multi-layer overlay network providing various services with variable guarantees, and promoting an intermittent participation to the virtual organization where peers can appear, disappear and organize themselves dynamically. Arigatoni mainly concerns with how resources are declared and discovered in the overlay, allowing global computers to make a secure, PKI-based, use of global aggregated computational power, storage, information resources, etc. Arigatoni provides fully decentralized, asynchronous and scalable resource discovery, and provides mechanisms for dealing with dynamic virtual organizations. This paper introduces a non trivial improvement of the original resource discovery protocol by allowing to register and to ask for multiple instances. Simulations show that it is efficient and scalable